Building Theories into Instantiation

Instantiation orderings over formulas (the relation of one formula bemg an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning A variety of instantiation ordenngs are now IP use, many of which incorporate some k ind of background information in the form of a constraint theory Even a casual examination of these instantiation orderings reveals that they are somehow related, but in exactly what way? This paper presents a general instantiation ordering of which all these orderings are special cases, as are other instantiat ion ordenngs The paper shows that this general ordering has the semantic properties we desire in an instantiation ordering, implying that the special cases have these properties as well The extension to this general ordering is useful in applications to inductive logic programming, automated deduction and logic programming, knowledge-base vivification, and database systems